graph minor造句

例句与造句

1. Important variants of graph minors include the topological minors and immersion minors.
2. Graph minors are often studied in the more general context of matroid minors.
3. A more substantial example is the graph minor theorem.
4. The related but more general graph minor theorem ( 2003 ) has consequences for computational complexity theory.
5. The family of graphs in which each component is a cactus is downwardly closed under graph minor operations.
6. It's difficult to find graph minor in a sentence. 用graph minor造句挺难的
7. The Robertson Seymour theorem states that finite undirected graphs and graph minors form a well-quasi-ordering.
8. The family of graphs in which each connected component is a cactus graph is downwardly closed under graph minor operations.
9. Like the apex graphs and the linkless embeddable graphs, the Y?Y-reducible graphs are closed under graph minors.
10. In this variation of graph minor theory, a graph is always simplified after any edge contraction to eliminate its self-loops and multiple edges.
11. Analogous characterizations of other families of graphs in terms of the summands of their clique-sum decompositions have since become standard in graph minor theory.
12. Edge contraction is a fundamental operation in the theory of graph minors . "'Vertex identification "'is a less restrictive form of this operation.
13. In some cases, the term " hereditary " has been defined with reference to graph minors, but this is more properly called a "'minor-hereditary property " '.
14. The award citation listed accomplishments including his work on the carpenter's rule problem, hinged dissection, prefix sum data structures, competitive analysis of binary search trees, graph minors, and computational origami.
15. It is obvious that the graph minor relationship does not contain any infinite descending chain, because each contraction or deletion reduces the number of edges and vertices of the graph ( a non-negative integer ).
16. Some natural examples include consistency statements from logic, several statements related to Ramsey theory such as the Szemer閐i regularity lemma and the graph minor theorem, and Tarjan's algorithm for the disjoint-set data structure.
更多例句：  下一页